Efficacy of Beam Thresholding, Unification Filtering and Hybrid Parsing in Probabilistic HPSG Parsing

نویسندگان

  • Takashi Ninomiya
  • Yoshimasa Tsuruoka
  • Yusuke Miyao
  • Jun'ichi Tsujii
چکیده

We investigated the performance efficacy of beam search parsing and deep parsing techniques in probabilistic HPSG parsing using the Penn treebank. We first tested the beam thresholding and iterative parsing developed for PCFG parsing with an HPSG. Next, we tested three techniques originally developed for deep parsing: quick check, large constituent inhibition, and hybrid parsing with a CFG chunk parser. The contributions of the large constituent inhibition and global thresholding were not significant, while the quick check and chunk parser greatly contributed to total parsing performance. The precision, recall and average parsing time for the Penn treebank (Section 23) were 87.85%, 86.85%, and 360 ms, respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast and Scalable HPSG Parsing

We investigated the efficacy of beam search parsing and deep parsing techniques in probabilistic HPSG parsing. We first tested the beam thresholding and iterative parsing. Next, we tested three techniques originally developed for deep parsing: quick check, large constituent inhibition, and hybrid parsing with a CFG chunk parser. The quick check, iterative parsing and hybrid parsing greatly cont...

متن کامل

Towards efficient probabilistic HPSG parsing: integrating semantic and syntactic preference to guide the parsing

We present a framework for efficient parsing with probabilistic Head-driven Phrase Structure Grammars (HPSG). The parser can integrate semantic and syntactic preference into figures-of-merit (FOMs) with the equivalence class function during parsing, and reduce the search space by using the integrated FOMs. This paper presents a CKY algorithm with this function and experimental results of beam t...

متن کامل

Probabilistic Models for Disambiguation of an HPSG-Based Chart Generator

We describe probabilistic models for a chart generator based on HPSG. Within the research field of parsing with lexicalized grammars such as HPSG, recent developments have achieved efficient estimation of probabilistic models and high-speed parsing guided by probabilistic models. The focus of this paper is to show that two essential techniques – model estimation on packed parse forests and beam...

متن کامل

Bilexical Dependencies as an Intermedium for Data-Driven and HPSG-Based Parsing

Bilexical dependencies capturing asymmetrical lexical relations between heads and dependents are viewed as a practical representation of syntax that is well-suited for computation and intelligible for human readers. In the present work we use dependency representations as a bridge between data-driven and grammar-based parsing, both for cross-framework parser comparison and for parser integratio...

متن کامل

Deterministic Shift-Reduce Parsing for Unification-Based Grammars by Using Default Unification

Many parsing techniques including parameter estimation assume the use of a packed parse forest for efficient and accurate parsing. However, they have several inherent problems deriving from the restriction of locality in the packed parse forest. Deterministic parsing is one of solutions that can achieve simple and fast parsing without the mechanisms of the packed parse forest by accurately choo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005